An Optimal Matching Problem
نویسنده
چکیده
Suppose we are given three goods, X,Y , and Z. They are not homogeneous, but come in different qualities, x ∈ X , y ∈ Y and z ∈ Z. Goods X and Y are used for the sole purpose of producing good Z, which we are interested in. To obtain one piece of good Z, one has to assemble one piece of good X and one piece of good Y . More precisely, one can obtain a piece of quality z by assembling one piece of quality x and one piece of quality y, yielding a benefit of u (x, z) + w (y, z). Given the distributions μ and ν of goods X and Y , one wishes to minimize the total benefit of production. This translates into the following optimization problem: find maps s : X → Z and t : Y → Z such that s (μ) = t (ν) (this is the matching condition) and the integral
منابع مشابه
The matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملMatching of Polygon Objects by Optimizing Geometric Criteria
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....
متن کاملAnalytical Matching of Optimal Damping Characteristics Curve for Vehicle Passive Suspensions
To facilitate the damping matching of dampers for vehicle passive suspensions, this paper proposes an analytical matching method of the optimal piecewise linear damping characteristics curve. Based on the vehicle vibration model, taking the suspension dynamic deflection as the constraint, by the vibration acceleration and the wheel dynamic load, an objective function about the relative damping ...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملComparative Research on Optimal Damping Matching of Seat System for an off-Highway Dump Truck
To protect the driver of off-highway dump trucks from the harmful vibration, this paper presents the comparison results to determine the optimal damping of the seat system by different optimization design plans. Three optimization schemes are considered including individually optimizing the damping of the cushion, individually optimizing the damping of the seat suspension, and integrately optim...
متن کاملA Novel Assisted History Matching Workflow and its Application in a Full Field Reservoir Simulation Model
The significant increase in using reservoir simulation models poses significant challenges in the design and calibration of models. Moreover, conventional model calibration, history matching, is usually performed using a trial and error process of adjusting model parameters until a satisfactory match is obtained. In addition, history matching is an inverse problem, and hence it may have non-uni...
متن کامل